On Model Checking Durational Kripke Structures

On model checking durational Kripke structures (Extended Abstract)

Efficient timed model checking for discrete-time systems

We consider model checking of timed temporal formulae in durational transition graphs (DTGs), i.e., Kripke structures where transitions have integer durations. Two semantics for DTGs are presented and motivated. We consider timed versions of CTL where subscripts put quantitative constraints on the time it takes before a property is satisfied. We exhibit an important gap between logics where sub...

Computing (bi)simulation relations preserving CTLX for ordinary and fair Kripke structures

The main goal of model checking is to verify whether a model of a given program satisfies some given specification. In this paper models are regarded as fair or ordinary Kripke structures whereas specifications are represented by formulae branching-time temporal logics (CTL∗X or ACTL ∗ X ). Model checking can be substantially enhanced by reducing the size of models under consideration. Usually ...

Adapting Biochemical Kripke Structures for Distributed Model Checking

In this paper, we use some observations on the nature of biochemical reactions to derive interesting properties of qualitative biochemical Kripke structures. We show that these characteristics make Kripke structures of biochemical pathways suitable for assumption based distributed model checking. The number of chemical species participating in a biochemical reaction is usually bounded by a smal...

Model checking finite paths and trees

This thesis presents efficient parallel algorithms for checking temporal logic formulas over finite paths and trees. We show that LTL path checking is in AC(logDCFL) and CTL tree checking is in AC(logDCFL). For LTL with pasttime and bounded modalities, which is an exponentially more succinct logic, we show that the path checking problem remains in AC(logDCFL). Our results provide a foundation f...